Nonnegative Matrix Factorisation of Bike Sharing System Temporal Networks
ثبت نشده
چکیده
In recent years, bike sharing systems have become very popular in many major 1 cities. Thanks to the data they generate, their activity can be tracked down, giving 2 an overall view of how human activities are spread over time and space. We propose 3 in the present article a novel method to extract mobility patterns that occur in such 4 large-scale transportation systems. The trips made by the users are first represented 5 as flows between the different stations of the system, describing a network whose 6 structure evolves over time. A decomposition technique is then proposed using 7 non-negative matrix factorisation, to express the resulting temporal networks as 8 a mixture of sub-networks, each of them characterising the different behaviours 9 of users over time and space. This method is applied on the Lyon’s bike sharing 10 system, and it is emphasised that key spatio-temporal elements of urban activity 11 are retrieved, capturing known phenomena such as commuting. This approach 12 could be easily extended to large-scale transportation systems exhibiting a network 13 structure, paving the way to an unsupervised modelling of mobility patterns. 14
منابع مشابه
Tracking Time Evolution of Collective Attention Clusters in Twitter: Time Evolving Nonnegative Matrix Factorisation
Micro-blogging services, such as Twitter, offer opportunities to analyse user behaviour. Discovering and distinguishing behavioural patterns in micro-blogging services is valuable. However, it is difficult and challenging to distinguish users, and to track the temporal development of collective attention within distinct user groups in Twitter. In this paper, we formulate this problem as trackin...
متن کاملFast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation
Nonnegative matrix factorisation and tri-factorisation Nonnegative matrix factorisation (NMF) and tri-factorisation (NMTF) methods decompose a given matrix R into two or three smaller matrices so that R ≈ UV T or R ≈ FSG , respectively. Schmidt, Winther and Hansen (2009) introduced a Bayesian version of nonnegative matrix factorisation (left), which we extend to matrix tri-factorisation (right)...
متن کاملA Nonlinear Solution to Closed Queueing Networks for Bike Sharing Systems with Markovian Arrival Processes and Under an Irreducible Path Graph
As a favorite urban public transport mode, the bike sharing system is a largescale and complicated system, and there exists a key requirement that a user and a bike should be matched sufficiently in time. Such matched behavior makes analysis of the bike sharing systems more difficult and challenging. To design a better bike sharing system, it is a key to analyze and compute the probabilities of...
متن کاملPredicting Station-level Hourly Demands in a Large-scale Bike-sharing Network: A Graph Convolutional Neural Network Approach
Bike sharing is a vital piece in a modern multi-modal transportation system. However, it suffers from the bike unbalancing problem due to fluctuating spatial and temporal demands. Accurate bike sharing demand predictions can help operators to make optimal routes and schedules for bike redistributions, and therefore enhance the system efficiency. In this study, we propose a novel Graph Convoluti...
متن کاملA Unified Framework for Analyzing Closed Queueing Networks in Bike Sharing Systems
During the last decade bike sharing systems have emerged as a public transport mode in urban short trips in more than 500 major cities around the world. For the mobility service mode, many challenges from its operations are not well addressed yet, for example, how to develop the bike sharing systems to be able to effectively satisfy the fluctuating demands both for bikes and for vacant lockers....
متن کامل